Explicit analytical solution for scaling quantum graphs.

نویسندگان

  • Yu Dabaghian
  • R Blümel
چکیده

We show that scaling quantum graphs with arbitrary topology are explicitly analytically solvable. This is surprising since quantum graphs are excellent models of quantum chaos and quantum chaotic systems are not usually explicitly analytically solvable.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

J an 2 00 3 Explicit , analytical solution of scaling quantum graphs

Based on earlier work on regular quantum graphs we show that a large class of scaling quantum graphs with arbitrary topology are explicitly analytically solvable. This is surprising since quantum graphs are excellent models of quantum chaos and quantum chaotic systems are not usually explicitly analytically solvable.

متن کامل

ua nt - p h / 03 01 00 3 v 1 3 J an 2 00 3 Explicit , analytical solution of scaling quantum graphs

Based on earlier work on regular quantum graphs we show that a large class of scaling quantum graphs with arbitrary topology are explicitly analytically solvable. This is surprising since quantum graphs are excellent models of quantum chaos and quantum chaotic systems are not usually explicitly analytically solvable.

متن کامل

Explicit spectral formulas for scaling quantum graphs.

We present an exact analytical solution of the spectral problem of quasi-one-dimensional scaling quantum graphs. Strongly stochastic in the classical limit, these systems are frequently employed as models of quantum chaos. We show that despite their classical stochasticity all scaling quantum graphs are explicitly solvable in the form E(n) =f (n) , where n is the sequence number of the energy l...

متن کامل

Explicitly solvable cases of one-dimensional quantum chaos.

We identify a set of quantum graphs with unique and precisely defined spectral properties called regular quantum graphs. Although chaotic in their classical limit with positive topological entropy, regular quantum graphs are explicitly solvable. The proof is constructive: we present exact, convergent periodic orbit expansions for individual energy levels, thus obtaining an analytical solution f...

متن کامل

Periodic orbit theory and spectral statistics for scaling quantum graphs

The explicit solution to the spectral problem of quantum graphs found recently in [20], is used to produce the exact periodic orbit theory description for the probability distributions of spectral statistics, including the distribution for the nearest neighbor separations, s n = k n − k n−1 , and the distribution of the spectral oscillations around the average, δk n = k n − ¯ k n .

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Physical review. E, Statistical, nonlinear, and soft matter physics

دوره 68 5 Pt 2  شماره 

صفحات  -

تاریخ انتشار 2003